Transparent, Scalable, Eecient Oo-persistence
نویسنده
چکیده
This document describes how e cient, scalable persistence has been transparently added to the Mj lner System (MS) by changing the generational garbage collector to identify and remove persistent objects from memory onto persistent storage, while hardware support has been utilized to load persistent objects on demand. MS supports development of programs written in BETA, which are statically typed, garbage collected and compiled into binary machine code. The changes introduced to support persistence have not a ected the size, layout or handling of non-persistent objects.
منابع مشابه
Ferreira 1 and Marc Shapiro 21 INESC / IST
Caching and persistence support eecient, convenient and transparent distributed data sharing. The most natural model of persistence is persistence by reachability, managed automatically by a garbage collector (GC). We propose a very general model of such a system (based on distributed shared memory) and a scalable, asynchronous distributed GC algorithm. Within this model, we show suucient and w...
متن کاملEecient Scalable Fair Cash with Oo-line Extortion Prevention
There have been many proposals to realize anonymous electronic cash. Although these systems ooer high privacy to the users, they have the disadvantage that the anonymity might be misused by criminals to commit perfect crimes. The recent research focuses therefore on the realization of fair electronic cash systems where the anonymity of the coins is revocable by a trustee in the case of fraudule...
متن کاملScalable Storage for a Dbms Using Transparent Distribution Scalable Storage for a Dbms Using Transparent Distribution
Scalable Distributed Data Structures (SDDSs) provide a self-managing and self-organizing data storage of potentially unbounded size. This stands in contrast to common distribution schemas deployed in conventional distributed DBMS. SDDSs, however, have mostly been used in synthetic scenarios to investigate their properties. In this paper we concentrate on the integration of the LH* SDDS into our...
متن کاملA Scalable Bit - Sequential SIMD Array for Nearest - NeighborClassi cation using the City - Block
We present a fully scalable SIMD array architecture for a most eecient implementation of pattern classiication by nearest-neighbor algorithms using the city-block metric. The elementary accumulator cell is highly optimized for a sequential accumulation of absolute integer diierences, so that several hundreds of them can be easily integrated on a single chip. A two-dimensional M N array structur...
متن کامل( O 3 ) 2 : From " poor - man ’ s persistence " to Transparent Clustering for Java Applications ∗
Since object-oriented programming has become dominant in application development, there has been the recurring issue of an impedance mismatch between the way programmers manipulate objects in memory, and the way they are made persistent in secondary storage. To address the aforementioned mismatch, a number of object-oriented database (OODB) systems were developed that embodied transparent (or o...
متن کامل